Minimal-program complexity of sequences with restricted resources
نویسندگان
چکیده
منابع مشابه
Minimal-Program Complexity of Sequences with Restricted Resources
In this paper we investigate the minimal-program complexity of several types of pseudo-recursive and pseudo-random sequences when the resources used for their computation are restricted. For several types of these sequences their minimal-progra m complexity increases enormously whenever the resources for their computation is restricted in any effective manner at all. In particular, it is shown ...
متن کاملConstruction of de Bruijn sequences of minimal complexity
It is well known that the linear complexity of a de Bruijn sequence S of length 2 " is bounded below by 2 "-' + n for n > 3. It is shown that this lower bound is attainable for all n.
متن کاملIncremental Evolution with Minimal Resources
This papers describes an evolutionary algorithm based on a statistical representation of populations of individuals. Experiments on robot navigation and on numerical fitness functions are presented in order to measure the performance of the algorithm compared to traditional genetic algorithms. Results show that the method is suitable for onboard online evolution because it requires low amount o...
متن کاملRestricted Complexity, General Complexity
Why has the problematic of complexity appeared so late? And why would it be justified? 1. The three principles of the rejection of complexity by 'classical science' Classical science rejected complexity in virtue of three fundamental explanatory principles: (1) The principle of universal determinism, illustrated by Laplace's Daemon, capable, thanks to his intelligence and extremely developed se...
متن کاملPrediction with Restricted Resources and Finite Automata
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state automata with a specified number, m, of states to the set of all binary sequences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)80001-4